Structural Analysis of Narratives with the Coq Proof Assistant
نویسندگان
چکیده
This paper proposes a novel application of Interactive Proof Assistants for studying the formal properties of Narratives, building on recent work demonstrating the suitability of Intuitionistic Linear Logic as a conceptual model. More specifically, we describe a method for modelling narrative resources and actions, together with constraints on the story endings in the form of an ILL sequent. We describe how well-formed narratives can be interpreted from cut-free proof trees of the sequent obtained using Coq. We finally describe how to reason about narratives at the structural level using Coq: by allowing to prove 2nd order properties on the set of all the proofs generated by a sequent, Coq assists the verification of structural narrative properties traversing all possible variants of a given plot.
منابع مشابه
Computer Verified Exact Analysis (Tutorial)
This tutorial will illustrate how to use the Coq proof assistant to implement effective and provably correct computation for analysis. Coq provides a dependently typed functional programming language that allows users to specify both programs and formal proofs. We will introduce dependent type theory and show how it can be used to develop both mathematics and programming. We will show how to us...
متن کاملFormal Veriication of Microprocessors: a Rst Experiment with the Coq Proof Assistant
We propose in this paper a study of the Coq proof assistant for formally verifying microprocessors. We show that interactive proofs with Coq are only required to verify complex instructions of microprocessors. We give our speciication and veriication methodology and some details about the word library developed in Coq. Two full examples show additional speciication and veriication aspects. We a...
متن کاملTowards the Safety Verification of Real-Time Systems with the Coq Proof Assistant
Hybrid systems are systems involving the interaction of discrete and continuous dynamics. Hybrid systems have been used as a mathematical model for many safety critical applications. One of the most important analysis problems of hybrid systems is the reachability problem. Approaches based on predicate abstraction are widely used for the reachability analysis. They are not efficient enough beca...
متن کاملExtraction certifiée dans Coq-en-Coq
The Coq proof assistant allows generation of programs correct by construction. This feature—called extraction—can be used to build certified libraries. In this article, we present a formalization of the extraction in Coq, along with some properties that have been formally proved. This work is in line with B. Barras’s work on formalizing Coq in Coq. MOTS-CLÉS : assistant de preuve, calcul des co...
متن کاملWeakest Precondition for General Recursive Programs Formalized in Coq
This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is a deep embedding using the computational power intrinsic to type theory. Since Coq accepts only structural recursive functions, the computational embedding of general recursive programs is non-trivial. To justify the embedding,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011